Modal Consequence Relations

نویسنده

  • Marcus Kracht
چکیده

Logic is generally defined as the science of reasoning. Mathematical logic is mainly concerned with forms of reasoning that lead from true premises to true conclusions. Thus we say that the argument from σ0;σ1; · · · ;σn−1 to δ is logically correct if whenever σi is true for all i < n, then so is δ. In place of ‘argument’ one also speaks of a ‘rule’ or an ‘inference’ and says that the rule is valid. This approach culminated in the notion of a consequence relation, which is a relation between sets of formulae and a single formula. A consequence relation ` specifies which arguments are valid; the argument from a set Σ to a formula δ is valid in ` iff 〈Σ, δ〉 ∈ `, for which we write Σ ` δ. δ is a tautology of ` if ∅ ` δ, for which we also write ` δ. In the early years, research into modal logic was concerned with the question of finding the correct inference rules. This research line is still there but has been marginalized by the research into modal logics, where a logic is just a set of formulae; this set is the set of tautologies of a certain consequence relation, but many consequence relations share the same tautologies. The shift of focus in the research has to do in part with the precedent set by predicate logic: predicate logic is standardly axiomatized in a Hilbert-style fashion, which fixes the inference rules and leaves only the axioms as a parameter. Another source may have been the fact that there is a biunique correspondence between varieties of modal algebras and axiomatic extensions of K, which allowed for rather deep investigations into the space of logics, using the machinery of equational theories. This research lead to deep results on the structure of the lattice of modal logics and benefits also the research into consequence relations. Recently, however, algebraic logic has provided more and more tools that allow to extend the algebraic method to the study of consequence relations in general (see for example [59] and [14]). In particular the investigations into the Leibniz operator initiated by Blok and Pigozzi in [5] have brought new life into the discussion and allow to see a much broader picture than before. Now, even if one is comfortable with classical logic, it is not immediately clear what the correct inferences are in modal logic. The first problem is that it is not generally agreed what the meaning of the modal operator(s) is or should be. In fact, rather than a drawback, the availability of very many different interpretations is the strength of modal logic; it gives flexibility, however at the price that there is not one modal logic, there are uncountably many. For example, 2 as metaphysical necessity satisfies S5, 2 as provability in PA satisfies G, 2 as future necessity (arguably) satisfies S4.3, and so on. This is in part because the interpretation decides which algebras are suitable (intended) and which ones are not. However, there is another parameter of variation, and this is the notion of truth itself. In the most popular interpretation, truth is truth at a world; but we could also understand it

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normal Modal Preferential Consequence

One of the most successful approaches to the formalization of commonsense reasoning is the work by Lehmann and colleagues, known as the KLM approach, in which defeasible consequence relations with a preferential semantics are studied. In spite of its success, KLM is limited to propositional logic. In recent work we provided the semantic foundation for extending defeasible consequence relations ...

متن کامل

Reducing Modal Consequence Relations

In this paper we will investigate the possibility of reducing derivability in a modal consequence relation to consistency in unimodal and polymodal K by means of so–called reduction functions. We will present new and easy methods to prove standard results on decidability, complexity, finite model property, interpolation and Halldén–completeness using only the reduction functions. Some new resul...

متن کامل

Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations

In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between these deductive relations and conditional logics, and it is based on the usual possible world semantics devised for the latter. The label formalism KEM, introduced to account for the semantics of normal modal logics, ...

متن کامل

A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations

In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possible world semantics for conditional logic. The label formalism KEM , introduced to account for the semantics of normal modal logics, is easily adapted to the semantics of conditional logic by simply indexing labels with formulas....

متن کامل

Stable Canonical Rules

We introduce stable canonical rules and prove that each normal modal multi-conclusion consequence relation is axiomatizable by stable canonical rules. We apply these results to construct finite refutation patterns for modal formulas, and prove that each normal modal logic is axiomatizable by stable canonical rules. We also define stable multi-conclusion consequence relations and stable logics a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004